Forbidden triples for hamiltonicity
نویسندگان
چکیده
منابع مشابه
Forbidden triples implying Hamiltonicity: for all graphs
In [2], Brousek characterizes all triples of graphs, G1, G2, G3, with Gi = K1,3 for some i = 1, 2, or 3, such that all G1G2G3-free graphs contain a hamiltonian cycle. In [6], Faudree, Gould, Jacobson and Lesniak consider the problem of finding triples of graphs G1, G2, G3, none of which is a K1,s, s ≥ 3 such that G1, G2, G3-free graphs of sufficiently large order contain a hamiltonian cycle. In...
متن کاملPotential forbidden triples implying hamiltonicity: for sufficiently large graphs
In [2], Brousek characterizes all triples of connected graphs, G1, G2, G3, with Gi = K1,3 for some i = 1, 2, or 3, such that all G1G2G3free graphs contain a hamiltonian cycle. In [8], Faudree, Gould, Jacobson and Lesniak consider the problem of finding triples of graphs G1, G2, G3, none of which is a K1,s, s ≥ 3 such that G1G2G3-free graphs of sufficiently large order contain a hamiltonian cycl...
متن کاملForbidden subgraphs, stability and hamiltonicity
We study the stability of some classes of claw-free graphs deened in terms of forbidden subgraphs under the closure operation deened in 10]. We characterize all connected graphs A such that the class of all CA-free graphs (where C denotes the claw) is stable. Using this result, we prove that every 2-connected and CHP 8-free, CHZ 5-free or CHN 1;1;4-free graph is either hamiltonian or belongs to...
متن کاملClosure and Forbidden Pairs for Hamiltonicity
Let C be the claw K 1;3 and N the net, i.e. the only connected graph with degree sequence 333111. It is known Bedrossian 1991; Faudree and Gould 1997] that if X; Y is a pair of connected graphs such that, for any 2-connected graph G, G being X Y-free implies G is hamiltonian, then X is the claw C and Y belongs to a nite list of graphs, one of them being the net N. For any such pair X; Y we show...
متن کاملCharacterizing forbidden clawless triples implying hamiltonian graphs
In this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, su2cient to imply that a 2-connected graph of su2ciently large order is hamiltonian. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00326-0